Three-coloring triangle-free planar graphs in linear time
نویسندگان
چکیده
منابع مشابه
Three-coloring triangle-free planar graphs in linear time (extended abstract)
Grötzsch’s theorem states that every triangle-free planar graph is 3-colorable, and several relatively simple proofs of this fact were provided by Thomassen and other authors. It is easy to convert these proofs into quadratic-time algorithms to find a 3-coloring, but it is not clear how to find such a coloring in linear time (Kowalik used a nontrivial data structure to construct an O(n log n) a...
متن کاملFractional Coloring of Triangle-Free Planar Graphs
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3− 1 n+1/3 .
متن کاملThree-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies∗
We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d, then G is 3-colorable. In fact, we prove a more general theorem. Let G be a planar graph, and let H be a set of connected subgraphs of G, each of bounded size, such that every two distinct members of H are at least a ...
متن کاملThree-coloring triangle-free graphs on surfaces
Let G be a 4-critical graph with t triangles, embedded in a surface of genus g. Let c be the number of 4-cycles in G that do not bound a 2-cell face. We prove that X f face of G (|f | − 4) ≤ κ(g + t+ c− 1) for a fixed constant κ, thus generalizing and strengthening several known results. As a corollary, we prove that every triangle-free graph G embedded in a surface of genus g contains a set of...
متن کاملThree-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
We give a linear-time algorithm to decide 3-colorability of a trianglefree graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring for a bounded number of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2011
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2000807.2000809